Pii: S0166-5316(02)00121-9
نویسندگان
چکیده
The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server and database actions. We model system response times as sojourn times in a two-node open queueing network with a processor sharing (PS) node and a first-come-first-served (FCFS) node. External customers arrive at the PS node according to a Poisson process. After departing from the PS node a customer proceeds to the FCFS node with probability p, and with probability 1 − p the customer departs from the system. After a visit to the FCFS node, customers are fed back to the PS node. The service requirements at both nodes are exponentially distributed. The model is a Jackson network, admitting a product-from solution for the joint number of customers at the nodes, immediately leading to a closed-form expression for the mean sojourn times in steady-state. The variance of the sojourn times, however, does not admit an exact expression—the complexity is caused by the possibility of overtaking. In this paper we propose a methodology for deriving simple, explicit and fast-to-evaluate approximations for the variance of the sojourn times. Numerical results demonstrate that the approximations are very accurate in most model instances. © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Minimisation of the update response time in a distributed database system
This paper is concerned with the minimisation of the update response time in distributed database systems (DDBS) where resequencing algorithms are used to preserve the consistency of the databases. The authors proposed a novel resequencing technique, in reference [7], namely hop-by-hop resequencing with batch processing for connecting the first stage to the second stage of a two-stage DDBS. In ...
متن کاملPerformance analysis of the IEEE 1394 serial bus
IEEE 1394 is a standard for a high performance serial bus interface. It encompasses both isochronous transfer mode, which is suitable for real-time applications, and asynchronous transfer mode, which is appropriate for delay-insensitive applications. This standard can be used as a basis for constructing a small-size local area network. Two queueing models are proposed for a network operating un...
متن کاملPii: S0166-5316(02)00180-3
We consider the scenario where users access Next Generation Networks via Network Access Providers (NAP). We assume that users belong to N different classes and the bandwidth received by each class is determined by a User-Share Differentiation (USD) scheme. According to USD, each class is guaranteed a minimum bandwidth and all users accepted into the NAP are allocated the minimum bandwidth corre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002